Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems

نویسنده

  • Philippe Schnoebelen
چکیده

Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel systems is whether bisimulation is decidable. We show that bisimulation, simulation, and in fact all relations between bisimulation and trace inclusion are undecidable for lossy channel systems (and for lossy vector addition systems).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Undecidable Equivalences for Basic Parallel Processes

Article history: Received 10 December 2007 Revised 18 November 2008 Available online 31 January 2009 The trace equivalence of BPP was shown to be undecidable by Hirshfeld. We show that all the preorders and equivalences except bisimulation in Glabbeek’s linear time-branching time spectrum are undecidable for BPP. The results are obtained by extending Hirshfeld’s encoding ofMinskymachines into B...

متن کامل

Undecidability of Bisimulations in Concurrent Systems with Indeenite Number of Identical Processes

In this paper, we show that bisimulation equivalence between concurrent systems of the type described in 9] is undecidable for two logics | Linear Temporal Logic LT L and LT L without the nexttime operator. Such concurrent systems contain a control process and arbitrarily many identical user processes. These negative results indicate that it might be diicult to compare two such concurrent syste...

متن کامل

Deciding Bisimulation-Like Equivalences with Finite-State Processes

We design a general method for proving decidability of bisimulationlike equivalences between infinite-state processes and finite-state ones. We apply this method to the class of PAD processes, which strictly subsumes PA and pushdown (PDA) processes, showing that a large class of bisimulation-like equivalences (including e.g. strong and weak bisimilarity) is decidable between PAD and finite-stat...

متن کامل

Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract)

We consider the veriication of a class of innnite-state systems called lossy channel systems, which consist of nite-state processes communicating via unbounded but lossy FIFO channels. This class is able to model several interesting protocols, such as HDLC, the Alternating Bit Protocol, and other Sliding Window protocols. In earlier papers we have considered the decidability of various temporal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001